Time-Distance Transformations of Transportation Networks
نویسندگان
چکیده
منابع مشابه
Time-distance Mapping: Visualization of Transportation Level of Service
Time-distance mapping is a method to obtain a spatial configuration of points, so that the Euclidean distances between points consist with the given time distances. The approaches are divided broadly into two categories. One deals with the time-distances between all pairs of points. Multidimensional scaling (MDS) is generally applied to the solution. Another deals with the limited number of tim...
متن کاملEpistemic Relativity Theory (Part I): Time and Distance Transformations
Einstein's theory of special relativity (SR) theory dictates, as a force majeure, an ontic view, according to which relativity is a true state of nature. For example, the theory’s solution to the famous twin paradox prescribes the "traveling" twin returns truly and verifiably younger than the "staying" twin, thereby implying the “traveling” twin returns to the future. I propose an epistemic vie...
متن کاملInformation Relativity Theory (Part I): Time and Distance Transformations
Einstein's theory of special relativity (SR) theory dictates, as a force majeure, an ontic view, according to which relativity is a true state of nature. For example, the theory’s solution to the famous twin paradox prescribes the "traveling" twin returns truly and verifiably younger than the "staying" twin, thereby implying the “traveling” twin returns to the future. I propose an epistemic vie...
متن کاملLeast Expected Time Paths in Stochastic, Time-Varying Transportation Networks
We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random ...
متن کاملApplication of Neural Networks to Scheduling Problem including Transportation Time
This paper presents an approach for finding an optimal schedule of n-jobs and m-machines flowshop scheduling problem involving transportation time between jobs by using neural networks. An algorithm has been given for finding the optimal sequence in scheduling problem without transportation time [2]. Here, this algorithm is applied when transportation times are involved between machines to find...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geographical Analysis
سال: 2010
ISSN: 0016-7363
DOI: 10.1111/j.1538-4632.1977.tb00573.x